Efficiency of the u,v method of estimation.
نویسندگان
چکیده
Given a pool of motorists, how do we estimate the total intensity of those who had a prespecified number of traffic accidents in the past year? We previously have proposed the u,v method as a solution to estimation problems of this type. In this paper, we prove that the u, v method provides asymptotically efficient estimators in an important special case.
منابع مشابه
A numerical approach to solve eighth order boundary value problems by Haar wavelet collocation method
In this paper a robust and accurate algorithm based on Haar wavelet collocation method (HWCM) is proposed for solving eighth order boundary value problems. We used the Haar direct method for calculating multiple integrals of Haar functions. To illustrate the efficiency and accuracy of the concerned method, few examples are considered which arise in the mathematical modeling of fluid dynamics an...
متن کاملEstimation of Cadmium and Uranium in a stream sediment from Eshtehard region in Iran using an Artificial Neural Network
Considering the importance of Cd and U as pollutants of the environment, this study aims to predict the concentrations of these elements in a stream sediment from the Eshtehard region in Iran by means of a developed artificial neural network (ANN) model. The forward selection (FS) method is used to select the input variables and develop hybrid models by ANN. From 45 input candidates, 13 and 14 ...
متن کاملThe effect of estimation methods on multifractal modeling for mineralized zone delineation in the Dardevey iron ore deposit, NE Iran
The purpose of this study is to identify the effect of Ordinary Kriging (OK) and Inverse Distance Weighted (IDW) estimation methods for the delineation of mineralized zones based on subsurface data using concentration–volume (C–V) multifractal modeling in the Dardevey iron ore deposit, NE Iran. Variograms and anisotropic ellipsoid were generated for the Fe distribution by the above estimation m...
متن کاملOn the revised edge-Szeged index of graphs
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
متن کاملMoment Inequalities for Supremum of Empirical Processes of U-Statistic Structure and Application to Density Estimation
We derive moment inequalities for the supremum of empirical processes of U-Statistic structure and give application to kernel type density estimation and estimation of the distribution function for functions of observations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 97 24 شماره
صفحات -
تاریخ انتشار 2000